Flash Memory Cache for Data Storage Device

ABSTRACT

A storage device made up of multiple storage media is configured such that one such media serves as a cache for data stored on another of such media. The device includes a controller configured to manage the cache by consolidating information concerning obsolete data stored in the cache with information concerning data no longer desired to be stored in the cache, and erase segments of the cache containing one or more of the blocks of obsolete data and the blocks of data that are no longer desired to be stored in the cache to produce reclaimed segments of the cache.

FIELD OF THE INVENTION

The present invention relates to the use of a flash memory-based cachefor data stored in a hard disk-based storage device and, in particular,to techniques for integrating cache management operations with writecoalescing and providing other efficiencies in such a caching device.

BACKGROUND

As most computer users know, data storage is of paramount importance.Different forms of data storage devices have been developed to addressdifferent needs. For example, some data storage devices are optimized toallow very rapid read and write accesses, so as not to present abottleneck to other processing operations involving the data being readfrom or written to the storage device. Usually, these high speedread/write storage devices can only accommodate a limited amount of dataand/or are expensive. Other storage devices are designed to accommodatelarge volumes of data (e.g., terabytes of data), but operate at muchslower speeds. Such devices are usually intended for applications wherethe cost of high speed storage devices is not justified.

A popular form of storage system is one that uses rapidly rotating diskscoated with a magnetic material to store data in the form ofmagnetically encoded information elements. These so-called hard diskdrives (HDD), or simply hard disks, are found in many personal computersand dedicated storage appliances. Hard disks can offer significantavailable storage space (e.g., on the order of terabytes), but the speedat which data can be read from such devices is limited by physicalproperties such as the size of the disk(s) on which the data is stored,the speed at which the disk(s) rotate, and the time required for theread head to be maneuvered into the correct position to read therequested data information elements (the so-called seek time).

So-called solid state storage devices, typically those that employ flashmemory arrays as the storage medium, offer improved read times, in partbecause there are no moving parts associated with such a device. Writetimes, however, are often worse than those associated with hard disksbecause flash arrays can only be written in relatively large “eraseblock” sizes (e.g., typically 128 KB-512 KB), which must be erased andrewritten in their entirety even if only a small amount of data withinthe block needs to be updated.

To address the inefficiencies inherent with writes to a flash array,flash memory controllers typically employ a process known as writecoalescing. This allows the flash controllers to deliver acceptableperformance for random writes (i.e., writes to random, non-sequentialaddresses within the flash array). Write coalescing uses principles thatwere first developed for log structured file systems. In essence, thistechnique bundles together or coalesces a group of random writes so thatthe data associated with those applications is written to a physicallycontiguous region of flash memory, called a “segment” (in flash, asegment should be an integral multiple of the erase block size).

An associated process performed by the flash controller, known as“garbage collection”, ensures that large segments of the flash array arekept available for the contiguous writes required for proper writecoalescing. As an application updates data at arbitrary logicaladdresses, and those data blocks are written to new physical locationsin the flash array, any preexisting versions of the data in previouslywritten portions of the array are marked as “obsolete”, meaning thatthese versions are no longer needed. Note, the data blocks referred toimmediately above is best understood as a unit for writing to the flashand is different than the erase blocks referred to previously. Thesedata blocks are typically much smaller than the erase blocks, e.g., onthe order of 4 KB-8KB, depending on the flash controller. Herein, theterm block, when used by itself, should be understood as referring tothese data blocks. The term erase block will be used when referringspecifically to erase blocks.

The obsolete blocks tend to be scattered about the flash array, due tothe nature of the random updates performed by the application making useof the data, but a garbage collection routine running on the flashcontroller periodically regenerates entire segments by copyingnon-obsolete blocks of data in previously written segments of the arrayinto a smaller number of new segments and then erasing the old segments.

Today, new forms of storage devices that employ both flash memory andhard disks are being marketed. In some instances, the flash memoryportion of these devices is being used as a cache for data stored on thehard disk. A cache is generally regarded to be a storage area that holdsa subset of the data stored on a larger, generally slower, device. Here,the flash memory cache provides faster read access than the hard diskand so data stored in the cache portion of the device can be deliveredmore rapidly than if the data had to be accessed from the hard disk. Ofcourse, while a flash memory-based cache offers advantages for reads,the problems inherent with random writes must still be addressed.

SUMMARY OF THE INVENTION

Embodiments of the present invention provide systems and methods inwhich a flash memory controller of a flash array configured as a cachefor a disk-based storage device, consolidates information concerningblocks of obsolete data stored in the flash array with informationconcerning blocks of data stored in the flash array that a cachemanagement routine running on the controller has determined may beremoved from the cache; and erases (or instructs erasure of) segmentscontaining one or more of the blocks of obsolete data and the blocks ofdata that the cache management routine has determined may be removedfrom the cache to produce reclaimed segments of the flash array. Eachsegment may include multiple blocks of the flash array. In variousembodiments, the blocks of obsolete data may include data that has beenmade obsolete as a result of more recent versions of said data beingwritten to the flash array. Further, the blocks of data that the cachemanagement routine has determined may be removed from the cache mayinclude data that is less frequently and/or recently used by anapplication accessing the cache than other data stored in the cache.

Prior to erasing segments containing one or more of the blocks ofobsolete data and the blocks of data that the cache management routinehas determined may be removed from the cache, the controller may write(or instruct writing) valid data from the segments to other segments inthe flash array. In some cases, fewer than all of the segmentscontaining one or more of the blocks of obsolete data and the blocks ofdata that the cache management routine has determined may be removedfrom the cache are erased. Further, the segments containing one or moreof the blocks of obsolete data and the blocks of data that the cachemanagement routine has determined may be removed from the cache may beranked, and the segments erased according to their respective rankingsFor example, the segments may be ranked according to a total number ofblocks of obsolete data and the blocks of data that the cache managementroutine has determined may be removed from the cache each contains.Alternatively, the segments may be ranked according to a percentage of atotal number of blocks of obsolete data and the blocks of data that thecache management routine has determined may be removed from the cacheeach contains to a total number of blocks in each segment.

The controller may further maintain a direct mapping of block addressesused by an application accessing data stored in the storage device withphysical locations of said data within the flash memory.

These and other embodiments of the invention are discussed furtherbelow.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention is illustrated by way of example, and notlimitation, in the figures of the accompanying drawings in which:

FIGS. 1A and 1B illustrate examples of storage devices employing a flashmemory-based cache for a hard disk and configured for operation inaccordance with embodiments of the present invention;

FIG. 2 illustrates an example of a conventional garbage collectionprocess employed by flash memory storage devices;

FIG. 3 illustrates distinctions between conventional two-level mappingsrequired for address translation in a conventional flash memory deviceand a single level mapping as employed in embodiments of the presentinvention;

FIG. 4 illustrates an example of a garbage collection process thatleverages information concerning cache management operations inaccordance with embodiments of the present invention; and

FIG. 5 is a flow diagram illustrating an example of a garbage collectionroutine that leverages information concerning cache managementoperations in accordance with embodiments of the present invention.

DETAILED DESCRIPTION

Described herein are techniques for improving the efficiency of flashmemory storage devices when used as a data cache for hard disks.

As mentioned above, when compared to hard disks, flash memory providesrelatively fast reads, but is slow when it comes to small writes (i.e.,those which do not involve large amounts of data) at random addresses.Therefore, flash memory-based storage devices typically coalescemultiple writes destined for random addresses into contiguous regions inthe flash array. However, such write coalescing requires concomitantgarbage collection activities, which impose a significant processingload and impact application performance.

While one could, in general, implement a flash memory-based cache for ahard disk-based storage system simply by layering some cache managementfunctions (e.g., functions for maintaining data likely to be used by anapplication in the cache while moving other data out of the cache) overa flash device that incorporates write coalescing, severalinefficiencies would likely result. Accordingly, the present inventionprovides techniques that integrate cache management and write coalescingto yield efficiencies for such a device. More specifically, the presentinvention provides methods and systems which offer improved reductionsin time and space overhead when looking up data in the cache, and whichreduce the processing load imposed by garbage collection routines,thereby reducing the impact on application performance.

FIG. 1A shows an example of a storage device 100 in which embodiments ofthe present invention may be instantiated. Storage device 100 includesone or more hard disks 102 and a flash memory-based cache 104. The disksand/or the flash memory cache may be included in an integrated storagedevice 100 or attached as separate devices (see e.g., the embodimentillustrated in FIG. 1B). The disks 102 and flash memory-based cache 104are under the control of a controller 106A, which may include firmwarethat instantiates integrated write coalescing/garbage collection andcache management routines as discussed herein. Storage device 100 isaccessible (e.g., to applications running on a host machine) via a hostinterface 108, which may, in general, conform to specifications fordisk-based storage devices common in the industry (e.g., an advancedhost controller interface that uses a serial ATA bus, a small computersystem interface (SCSI) or variants thereof, or an Internetprotocol-based protocol, etc.). Except where particular protocols arecalled out, the systems and methods disclosed herein do not depend onthe particular protocol being used and can be configured to operatecorrectly with all of them.

Controller 106A is, in some embodiments of the invention, configuredsuch that cache management operations are integrated with writecoalescing and garbage collection operations. This integration isachieved by providing a single mapping that maps backend block addresses(BBA) used by applications seeking to access data stored on storagedevice 100 to physical locations (PL) in the flash array. This singlelevel of mapping avoids the need to first translate BBAs to cache blockaddresses (CBAs) and then translate the CBAs to PLs as would be requiredif cache management operations remained distinct from write coalescingoperations. The map may be stored in a dynamic random access memory(DRAM) 110 accessible to controller 106A.

FIG. 1B illustrates an alternative example of a storage device 100′,which includes a backend storage device 110, having a hard disk, and acaching device 112, having a flash cache, communicatively coupled withone another by an interface 114. In this example, each of the backendstorage device and the caching device employ a controller, 106B and106C, respectively. Controller 106B is configured to manage storingoperations involving hard disk 102, while controller 106C is configuredto manage storage operations for the storage device 100′ in the mannerdescribed above for controller 106A. Thus, storage operations involvingthe hard disk and the flash cache may be distributed across multiplephysical devices, but managed in accordance with the present invention.

To better understand the above, consider first how a conventional cacheoperates. As noted above, a cache generally stores a subset of the datastored on a larger (in terms of storage capacity), usually slower (interms of read time), device. Thus, using a cache inherently requires amapping from the large addresses space of the slower, backend device tothe smaller address space of the cache. Such cache maps typically map ablock address of the backend storage device (the BBA) to a block addressin the cache (the CBA). If a block is not in the cache, the cache mapdoes not have an entry for its BBA.

The CBA is not, however, sufficient in terms of identifying the actualstorage location of data within the flash array. Recall that because aflash array cannot be written at random, write coalescing is used toprovide certain efficiencies. Referring to FIG. 2, a portion of a flasharray 200 is shown. Assume that a set of segments 202 ₁-202 ₆ of thecache device can each store four blocks. The segments of the flash arrayare each of a fixed (relatively large) size. As an application updatesblocks at arbitrary addresses (5, 2, 8, and 1 in this example), thewrites are coalesced so that the blocks are all written to segment 202₁. This is shown in the top illustration 2(a). While this sort of writecoalescing provides efficiencies in terms of write times, it means thata second map, one that maps CBAs to physical addresses within the flasharray, must be maintained.

As noted, the present invention eliminates the need for separateBBA-to-CBA and CBA-to-PL maps and instead provides a single BBA-to-PLmapping for a flash memory-based cache. This is illustrated in FIG. 3.In illustration 3(a), the conventional two-layer mapping is illustratedwith a BBA 300 being provided to a cache map 302 to produce a CBA 304,and the CBA 304 being provided to a location map 306 to produce a PL308. In contrast, the present invention uses a single cache-location map310 so that a BBA 300 can be directly translated to a PL 308, as shownin illustration 3(b).

But this efficient mapping process is not the only advantage offered bythe present invention. A second efficiency concerns the ability ofstorage devices configured in accordance with the invention to reducethe load presented by garbage collection processes by leveraging the“temperature” of blocks of data. To better understand this notion,consider the management operations performed in a conventional cache.

In order to take better advantage of the read speed afforded by a cache,many devices employ adaptive routines that seek to ensure data that isused frequently by the host (i.e., applications running on the host) isalways available in the cache. Typically, this involves makingpredictions about which data is likely to be needed (so-called “hot”data) and moving that data into the cache while also moving data lesslikely to be needed (so-called “cold” data) out of the cache to makeroom for the hot data. This movement of hot and cold data is referred toas cache management and while various techniques can be employed to makedecisions about which data should be classified as hot or cold, suchdetails are not critical to the present invention. That is, the presentinvention can be employed with any cache management routine. Forexample, cache management routines may determine the likelihood ofaccess (or “temperature”) of a particular block of data using heuristicsbased on how recently and/or frequently the block was accessed over aperiod of time, and such routines are well suited for use in connectionwith the present invention.

Returning to FIG. 2 and as shown in illustrations 2(b), 2(c) and 2(d),as an application continues to modify data, additional writes are made.As before, the writes are coalesced so that the data blocks are writtento contiguous segments 202 ₂ (illustration 2(b)), 202 ₃ (illustration2(c)) and 202 ₄ (illustration 2(d)). Notice, however, that in makingthese writes, updated versions of previously written blocks 8, 4 and 6must be written to new segments of the flash array, rather thanoverwriting a previous version thereof. This is an inherent limitationof write coalescing. The previously written version of a block becomesobsolete (as indicated by the cross hatching of previously writtenblocks in illustrations 2(b), 2(c) and 2(d), and a controller in theflash device keeps track of these obsolete blocks (e.g., either directlyor by tracking non-obsolete blocks and determining the obsolete blocksindirectly).

As should be apparent from this example, if the flash device were tocontinue writing new segments as the data is modified, the entireaddressable storage space of the flash array would quickly be filled. Toprevent this occurrence, the flash device reclaims storage space byidentifying segments that have obsolete versions of data blocks anderasing them. Before the erase can be made, however, the non-obsoleteblocks in the subject segments must be identified and “moved” (i.e.,copied) to new segments. This is shown in illustration 2(e).

In this example, segments 202 ₁, 202 ₂ and 202 ₃ were identified ashaving obsolete blocks (i.e., blocks 8, 4 and 6). The remaining blocksin these segments (i.e., blocks 5, 2, 1, 3, 7, 9, 4 and 10) werecollected and copied into as-yet unused segments 202 ₅ and 202 ₆. As aresult, segments 202 ₄, 202 ₅ and 202 ₆ now contain valid data, whilesegments 202 ₁, 202 ₂ and 202 ₃ all contain only obsolete data. Asillustration 2(f) indicates, the segments containing the obsolete dataare then erased, making them available for reuse.

This process of cleaning up segments that store obsolete data is knownas garbage collection and, as should be apparent from the foregoingdiscussion, it involves a significant internal read and write load onthe controller of the flash device. This reduces the available time forprocessing reads and writes requested by applications running on a host,thereby reducing the overall performance of the device. Further, theextra writes required for garbage collection reduce the effective writeendurance of the flash.

The present invention improves the efficiency of the garbage collectionoperations by leveraging block temperature. Instead of dealing solelywith data blocks that are garbage due to the existence of more recentlywritten versions thereof, the garbage collection operations of flashdevices configured in accordance with the present invention also treat“cold” data blocks as if they were garbage and make them eligible forreclamation as part of the garbage collection operation. As indicatedabove, this technique is independent of the actual criteria used todetermine which blocks are sufficiently “cold” to be treated asobsolete, making it applicable to any cache management process.

FIG. 4 shows an example of this process. In this sequence ofillustrations 4(a), 4(b) and 4(c), the results of the same sequence ofapplication updates shown in FIG. 2 are presented, but this time theeffect of treating cold blocks as garbage is included. So, comparingillustration 4(a) to illustration 2(d), in a portion of a flash array400, the same blocks 8, 4 and 6 in segments 402 ₂, 402 ₂ and 402 ₃ havebeen made obsolete by newly written blocks 6, 4 and 8 in segments 402 ₄,402 ₃ and 402 ₄, respectively (note that block 8 in segment 402 ₁ waspreviously obsoleted by a then-newly written block 8 in segment 402 ₂,but that block was itself obsoleted by the next writing of block 8 insegment 402 ₄).

This time, however, the garbage collection routine is provided withcache management information concerning cold block 2 in segment 402 ₁,cold block 3 in segment 402 ₂, cold blocks 9 and 10 in segment 402 ₃,and cold blocks 12 and 11 in segment 402 ₄. The cold nature of theseblocks is indicated by cross hatching in the opposite direction to thatused to highlight obsolete blocks. The information regarding thetemperature of these blocks is provided to the garbage collectionroutine in accordance with the present invention and is obtained fromthe cache management process that oversees the caching of data.

When the garbage collection routine now searches for segments to free upby rewriting non-obsolete blocks to new segments and erasing thepreviously used segments, the routine seeks out those segments that havethe greatest number or highest percentage of garbage blocks, consideringcold blocks as garbage blocks, and treats them as candidates forreclamation. In this example, as shown in illustration 4(b), segments402 ₁, 402 ₂ and 402 ₃ were selected. Blocks 5 and 1 from segment 402 ₁,block 7 from segment 402 ₂ and block 4 from segment 402 ₃ were rewrittento segment 402 ₅ and the original copies of these blocks then flagged asobsolete. As shown in illustration 4(c), this allows three segments, 402₁, 402 ₂ and 402 ₃, to be erased, freeing up new storage space for theapplication to write to.

Notice that by integrating the cache management and garbage collectionoperations a significant improvement in “write amplification” has beenachieved. Write amplification is a measure of the processing loadimposed by the garbage collection operations and can be expressed as aratio of the total number of blocks written within the flash array(because of either application updates or garbage collection) to thetotal number of blocks updated by the application. In the stable state,the number of blocks written by the application is equal to the numberof blocks freed by the garbage collection (GC) operation; therefore, thewrite amplification may be expressed as:

Write Amplification=(# of blocks copied by GC+# of blocks freed by GC)/#of blocks freed by GC

In the example shown in FIG. 2, the garbage collection operation copiedcurrent blocks from three segments into two segments, effectivelygenerating one additional free segment that could be used forapplication updates. Therefore, the write amplification of the devicewhich performed those activities could be expressed as:

Write Amplification=(8+4)/4=3

In general write amplification is the inverse of the average fraction ofobsolete or garbage blocks in segments collected by the garbagecollection routine.

In comparison, the process illustrated in FIG. 4 yields:

Write Amplification=(4+8)/8=1.5

This represents a move of data from three segments to one segment tofree up three segments and provides a write amplification one-half thatof the scenario depicted in FIG. 2. Lower write amplification indicatesa reduced processing load and so is a desirable goal. Again, the writeamplification is, in general, the inverse of the average fraction ofgarbage blocks, which now includes both obsolete and cold blocks.

This reduction in garbage collection load is not possible where cachemanagement is simply layered over a device that performs writecoalescing and garbage collection. In such a scheme, the garbagecollection routine would not have information concerning cold blocks andso no efficiencies would be obtained. Instead, as provided by thepresent invention, this significant improvement requires that the cachemanagement operations be integrated with the garbage collection andwrite coalescing operations of the flash device.

Further expediency simplifications could be achieved if a flash memorydevice can be permitted to actually drop some non-garbage blocks of datainstead of having to rewrite same to other segments during the garbagecollection operations. That is, in situations where it is not criticalthat data be retained in the flash memory, for example where the flashmemory serves as a cache for another persistent storage device ormedium, the garbage collection routine could be configured to simplytreat as garbage all of the blocks of segments that are comprised ofmostly obsolete or cold blocks, even where no other copies of some ofthe blocks in that segment exist in the cache. This may be useful, forexample, where space must be freed on an urgent basis or in othercircumstances where it is more important to ensure space is availablefor new data than to ensure that old data is available in the cache.Segment 402 ₂ in illustration 4(a) illustrates an example of a segmentthat could be treated in this fashion should the need arise.

It is also worth noting that the garbage collection routine need notaddress all possible segments having obsolete or cold blocks each timesegments are to be reclaimed (i.e., for each garbage collectionoperation, only a portion of the total number of available segments arereclaimed, generally those having the highest number or percentage ofobsolete/cold blocks). Notice in FIG. 4 that blocks 11 and 12 in segment402 ₄ were recognized as being cold, but these blocks were allowed tosurvive the garbage collection operations. In illustration 4(c), block12 has reverted to “hot” status (a determination made by the cachemanagement routine) and since it was not erased as part of the garbagecollection operation is still available in the flash array. If thedevice is used as a cache, this would improve overall read times forthis block.

In a related aspect of the present invention, extensions can be made toan ATA or SCSI “trim” command. The trim command has been proposed as ameans of allowing applications to indicate that a filesystem can “trim”certain blocks of storage space which are not currently allocated withinthe filesystem. In accordance with the present invention, this techniquecan be extended to provide a command that notifies a storage device ofchanges in a block's temperature (e.g., from hot to cold or vice versa).This would allow the storage device to take actions similar to thosediscussed above with reference to FIG. 4 and reduce its garbagecollection load by treating cold blocks as being eligible for erasure.However, such a use of the trim command would not be optimal because itwould not allow the cache management routine to revert a cold block ofdata to hot status (i.e., a “trimmed” block of data cannot be“untrimmed”). The above-described integration of cache management andgarbage collection permits such reversion.

The present invention thus provides efficiencies by consolidating themapping of block addresses to physical addresses into a single map,without the need for an intermediate cache block map, and further byintegrating cache management with write coalescing and garbagecollection. FIG. 5 is a flow diagram illustrating an example of aprocess 500 which may be performed by a flash controller in accordancewith the present invention.

At 502, a garbage collection routine in accordance with the invention isinitiated. As part of this routine, at 504, obsolete blocks areidentified. The identification may be done as in conventional garbagecollection routines.

At 506, information from a cache management routine (which may also beexecuting on the controller) regarding cold blocks is obtained. Theinformation may, for example, be read from a table maintained by thecache management routine and indicating which blocks are considered tobe cold. Note that the determination as to whether a block is hot orcold may be made in any conventional fashion, for example on the basisof which blocks are least recently used by an application, or othercriteria.

At 508, the process identifies those segments of the flash array havingobsolete and/or cold blocks and, optionally at 510, may select a subsetof those segments to be reclaimed. This is an optional step because insome implementations a garbage collection routine may simply reclaim apre-established number of segments each time it executes, for exampleany number of segments from one to all eligible segments may bereclaimed (although in most cases it will be best to limit reclamationto some number of segments less than all eligible segments in order toreduce the processing burden imposed by the garbage collection routine).

In determining which segments to reclaim, the garbage collection routinemay rank the eligible segments (a segment is eligible if it has at leastone obsolete or cold block) in terms of the number of obsolete/coldblocks they contain (or, conversely, the number of valid blocks theycontain). For example, segments having more (e.g., either literally oron a percentage of blocks-to-segment basis) obsolete/cold blocks may beranked higher than those having fewer obsolete/cold blocks. The garbagecollection routine may operate to reclaim segments in order of rank fromsuch a list, for example, each time reclaiming some pre-determinednumber of the ranked segments or some pre-determined fraction thereof.Alternatively the number of segments to be reclaimed may be determineddynamically based on a present processing load on the controller.

Regardless of how the segments identified for reclamation aredetermined, at 512 the valid data, if any, from those segments arerewritten to fresh segments as discussed above. This allows the copiesof those previously valid blocks to now be identified as obsolete in thesegments from which they were copied and, at 514, those segments arethen erased. That is, the segments are reclaimed for use by anapplication running on a host that is accessing the storage device inwhich the flash device is operating, for example as a cache.

At 516, the process checks to see if it is done with the reclamationprocess and, if so, quits at 518. Otherwise, the process repeats from504 by identifying new segments having obsolete blocks. In manyinstances, process 500 will execute continually in the background on thecontroller.

Thus, techniques for improving the efficiency of flash memory,especially when used as a data cache for hard disks, have beendescribed. In the foregoing description, several examples were set forthand discussed in detail, but these examples should not be read aslimiting the present invention, which is best measured in terms of theclaims that follow.

1. A method, comprising: in a flash memory controller of a flash arrayconfigured as a cache for a disk-based storage device, consolidatinginformation concerning blocks of obsolete data stored in the flash arraywith information concerning blocks of data stored in the flash arraythat a cache management routine running on the controller has determinedmay be removed from the cache; and erasing segments containing one ormore of the blocks of obsolete data and the blocks of data that thecache management routine has determined may be removed from the cache toproduce reclaimed segments of the flash array, wherein each segmentcomprises multiple blocks of the flash array.
 2. The method of claim 1,wherein the blocks of obsolete data comprise data that has been madeobsolete as a result of more recent versions of said data being writtento the flash array.
 3. The method of claim 2, wherein the blocks of datathat the cache management routine has determined may be removed from thecache comprise data that is less frequently and/or recently used by anapplication accessing the storage device than other data stored in thecache.
 4. The method of claim 1, wherein the blocks of data that thecache management routine has determined may be removed from the cachecomprise data that is less frequently and/or recently used by anapplication accessing the storage device than other data stored in thecache.
 5. The method of claim 1, wherein prior to erasing segmentscontaining one or more of the blocks of obsolete data and the blocks ofdata that the cache management routine has determined may be removedfrom the cache, writing valid data from the segments to other segmentsin the flash array.
 6. The method of claim 5, wherein fewer than all ofthe segments containing one or more of the blocks of obsolete data andthe blocks of data that the cache management routine has determined maybe removed from the cache are erased.
 7. The method of claim 6, furthercomprising ranking the segments containing one or more of the blocks ofobsolete data and the blocks of data that the cache management routinehas determined may be removed from the cache are erased, and wherein thesegments are erased according to their respective rankings.
 8. Themethod of claim 7, wherein the segments are ranked according to a totalnumber of blocks of obsolete data and the blocks of data that the cachemanagement routine has determined may be removed from the cache eachcontains.
 9. The method of claim 7, wherein the segments are rankedaccording to a percentage of a total number of blocks of obsolete dataand the blocks of data that the cache management routine has determinedmay be removed from the cache each contains to a total number of blocksin each segment.
 10. The method of claim 1, wherein selected segments ofthe cache are erased without copying any data, including any non-garbagedata, into new segments of the cache.
 11. A storage device, comprising:one or more magnetic storage media; a flash memory configured as a cachefor data stored on the magnetic storage media; a controller configuredto manage operations of the cache by consolidating informationconcerning blocks of obsolete data stored in the cache with informationconcerning blocks of data no longer desired to be stored in the cache,and erase segments of the cache containing one or more of the blocks ofobsolete data and the blocks of data that are no longer desired to bestored in the cache to produce reclaimed segments of the cache, whereineach segment comprises multiple blocks of the flash memory.
 12. Thestorage device of claim 11, wherein controller further maintains adirect mapping of block addresses used by an application accessing datastored in the storage device with physical locations of said data withinthe flash memory.
 13. The storage device of claim 11, wherein the blocksof obsolete data comprise data that has been made obsolete as a resultof more recent versions of said data being written to other blocks ofthe cache.
 14. The storage device of claim 13, wherein the blocks ofdata no longer desired to be stored in the cache comprise data that isless frequently and/or recently used by an application accessing thestorage device than other data stored in the cache.
 15. The storagedevice of claim 11, wherein the blocks of data no longer desired to bestored in the cache comprise data that is less frequently and/orrecently used by an application accessing the storage device than otherdata stored in the cache.
 16. The storage device of claim 11, whereinthe controller is further configured to write valid data from thesegments containing one or more of the blocks of obsolete data and theblocks of data no longer desired to be stored in the cache to othersegments of the cache prior to erasing said segments.
 17. The storagedevice of claim 16, wherein the controller is further configured toerase fewer than all of the segments containing one or more of theblocks of obsolete data and the blocks of data no longer desired to bestored in the cache are erased.
 18. The storage device of claim 17,wherein the controller is further configured to rank the segmentscontaining one or more of the blocks of obsolete data and blocks of datano longer desired to be stored in the cache, and to erase the segmentsaccording to their respective rankings
 19. The storage device of claim18, wherein the controller is further configured to rank the segmentsaccording to a total number of blocks of obsolete data and blocks ofdata no longer desired to be stored in the cache each contains.
 20. Thestorage device of claim 18, wherein the controller is further configuredto rank the segments according to a percentage of a total number ofblocks of obsolete data and blocks of data no longer desired to bestored in the cache each contains to a total number of blocks in eachsegment.
 21. A storage device, comprising multiple storage media, onesuch media serving as a cache for data stored on another of such media,and a controller configured to manage said cache by consolidatinginformation concerning obsolete data stored in the cache withinformation concerning data no longer desired to be stored in the cache,and erase segments of the cache containing one or more of the blocks ofobsolete data and the blocks of data that are no longer desired to bestored in the cache to produce reclaimed segments of the cache.